On Semi/tame Classes of Finite Structures

نویسنده

  • CAMERON DONNAY
چکیده

We modify the definition of robust chains from [25] as an approach to formalizing the Finite Sub-model Property (see [21], for example) from the perspective of a class of finite structures with a generic model (i.e. having the Amalgamation and Joint-embedding properties). We characterize this formulation, which we call super-robustness, modulo a weaker condition (that is closer to the the situation of a robust chain) that we call robustness. After observing that the more natural condition of a given class is super-robustness up to cofinality – which we call tameness – we prove that a number of natural constructions preserve tameness, and we prove some necessary conditions for tameness refining strong-minimality and total-categoricity. We define a notion of “locally pro-generic” type and verify that this definition provides a re-formulation of þindependence for generic models of certain tame classes. Finally, we show that any class that has the 0,1-law for first-order sentences compatibly with its generic theory is a tame class.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sweeping by a tame process

We show that any semi-algebraic sweeping process admits piecewise absolutely continuous solutions, and any such bounded trajectory must have finite length. Analogous results hold more generally for sweeping processes definable in o-minimal structures. This extends previous work on (sub)gradient dynamical systems beyond monotone sweeping sets.

متن کامل

Computability theoretic classifications for classes of structures

In this paper, we survey recent work in the study of classes of structures from the viewpoint of computability theory. We consider different ways of classifying classes of structures in terms of their global properties, and see how those affect the structures inside the class. On one extreme, we have the classes that are Σ-small. These are the classes which realize only countably many ∃-types, ...

متن کامل

Towards the decidability of the theory of modules over finite commutative rings

On the basis of the Klingler–Levy classification of finitely generated modules over commutative noetherian rings we approach the old problem of classifying finite commutative rings R with decidable theory of modules. We prove that if R is (finite length) wild, then the theory of all R-modules is undecidable, and verify decidability of this theory for some classes of tame finite commutative rings.

متن کامل

Trajectory length of the tame sweeping process

We show that bounded trajectories of the semi-algebraic, or more generally o-minimally definable, sweeping process have finite length. This result generalizes previous work on gradient/subgradient dynamical systems and paves the way for further extensions in control systems and mathematical mechanics.

متن کامل

Averaging T-structures and Extension Closure of Aisles

We ask when a finite set of t-structures in a triangulated category can be ‘averaged’ into one t-structure or, equivalently, when the extension closure of a finite set of aisles is again an aisle. There is a straightforward, positive answer for a finite set of compactly generated t-structures in a big triangulated category. For piecewise tame hereditary categories, we give a criterion for when ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016